Resource Allocation in Cooperative Communications

In this project, we have developed a framework for resource allocation in a multi user cooperative wireless network. We have considered centralized and decentralized node-relay assignment with the objective of maximizing the sum throughput. We present an efficient polynomial time centralized assignment algorithm to achieve this objective, and also investigate efficient decentralized schemes that do not require a central authority to perform the allocation. We present a novel message passing based assignment scheme which converges to the optimal value, and present an adapted scheme based on distributed auction theory. We also present a simple sub-optimal greedy assignment strategy and provide empirical data to support its practical significance.